منابع مشابه
Dihedral Sieving Phenomena
Abstract. Cyclic sieving is a well-known phenomenon where certain interesting polynomials, especially qanalogues, have useful interpretations related to actions and representations of the cyclic group. We define sieving for an arbitrary group G and study it for the dihedral group I2pnq of order 2n. This requires understanding the generators of the representation ring of the dihedral group. For ...
متن کاملCyclic Sieving Phenomena on Annular Noncrossing Permutations
We show cyclic sieving phenomena on annular noncrossing permutations with given cycle types. We define annular q-Kreweras numbers, annular q-Narayana numbers, and annular q-Catalan numbers, and show that a sum of annular q-Kreweras numbers becomes an annular q-Narayana number and a sum of annular q-Narayana numbers becomes an annular q-Catalan number. We also show that these polynomials are clo...
متن کاملBlock Sieving Algorithms Block Sieving Algorithms
Quite similiar to the Sieve of Erastosthenes, the best-known general algorithms for fac-toring large numbers today are memory-bounded processes. We develop three variations of the sieving phase and discuss them in detail. The fastest modiication is tailored to RISC processors and therefore especially suited for modern workstations and massively parallel supercomputers. For a 116 decimal digit c...
متن کاملDihedral Escherization
“Escherization” [9] is a process that finds an Escher-like tiling of the plane from tiles that resemble a user-supplied goal shape. We show how the original Escherization algorithm can be adapted to the dihedral case, producing tilings with two distinct shapes. We use a form of the adapted algorithm to create drawings in the style of Escher’s print Sky and Water. Finally, we develop an Escheriz...
متن کاملThe cyclic sieving phenomenon
The cyclic sieving phenomenon is defined for generating functions of a set affording a cyclic group action, generalizing Stembridge’s q 1⁄4 1 phenomenon. The phenomenon is shown to appear in various situations, involving q-binomial coefficients, Pólya–Redfield theory, polygon dissections, noncrossing partitions, finite reflection groups, and some finite field q-analogues. r 2004 Elsevier Inc. A...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2020
ISSN: 0012-365X
DOI: 10.1016/j.disc.2020.111849